Method of public key generation

ABSTRACT

A potential bias in the generation or a private key is avoided by selecting the key and comparing it against the system parameters. If a predetermined condition is attained it is accepted. If not it is rejected and a new key is generated.

FIELD OF THE INVENTION

[0001] The present invention relates Lo public key cryptosystems and more particularly to key generation within such systems.

BACKGROUND OF THE INVENTION

[0002] The basic structure of a public key cryptosystem is well known and has become ubiquitous with security in data communication systems. Such systems use a private key k and a corresponding public key α^(k) where α is a generator of the group. Thus one party may encrypt a message m with the intended recipients public key and the recipient may apply his private key to decrypt it.

[0003] Similarly, the cryptosystems may be used for key agreement protocols where each party exponentiates the other party's public key with their own private key. Thus party A will take B's public key α^(b) and exponentiate it with A's private key a to obtain a session key α^(ab). Similarly, B will take A's public key α^(a) and exponentiate it with B's private key b to obtain the same session key α^(ab). Thereafter data may be transferred using a symmetric key protocol utilizing the common session key.

[0004] Public key cryptosystems may also be used to sign messages to authenticate the author and/or the contents. In this case the sender will sign a message using his private key and a recipient can verify the message by applying the public key of the sender. If the received message and the recovered message correspond then the authenticity is verified.

[0005] The public key cryptosystems rely on the intractability of the discrete log problem in finite field arithmetic, that is even when the generator α and public key is known, it is computationally infeasible to obtain the corresponding private key. The security of such systems does therefore depend on the private key remaining secret. To mitigate the opportunity of disclosing the private key, protocols have been developed that use a pair of private keys and corresponding public keys, referred to as long term and short term or ephemeral key pairs respectively. The ephemeral private key is generated at the start of each session between a pair of correspondents, usually by a random number generator. The corresponding, ephemeral public key is generated and the resultant key pair used in one of the possible operations described above. The long-term public key is utilized to authenticate the correspondent through an appropriate protocol. Once the session is terminated, the ephemeral key is securely discarded and a new ephemeral key generated for a new session.

[0006] Some of the more popular protocols for signature are the ElGamal family of signature schemes such as the Digital Signature Algorithm or DSA. The DSA algorithm utilizes both long term and ephemeral keys to generate a signature of the message. The DSA domain parameters are preselected. They consist of a prime number p of a predetermined length, by way of example 1024 bits; a prime number q of a predetermined bit length, by way of example 160 bits, where q divides p−1; a generator α lying between 2 and p−1 and which satisfies the condition (α^(q)modp)=1, and; a cryptographic hash function H, such as SHA−1.

[0007] The DSA requires the signatory to select an ephemeral key k lying between 1 and q−1. A first signature component r is generated from the generator α such that r=(α^(k) mod p) mod q, A second signature component s is generated such that s=k⁻¹(H(m)+dr) mod q, and d is the long term private key of the signatory. The signature on the message m is (r,s). The signature may be verified by computing

[0008] H(m),

[0009] u₁=s⁻¹r(m)mod q

[0010] u₂=s⁻¹r modq

[0011] v=α^(u) ₁β^(u) ₂mod p, where β=α^(d) mod p is the long term public key of the signatory and finally verifying that r=v mod q. The use of both the ephemeral and long-term keys in the signature binds the identity of the signatory to the ephemeral key but does not render the long-term key vulnerable.

[0012] A similar signature protocol known as ECDSA may be used for elliptic curve cryptosystems. In this protocol k is selected in the interval 1 to n−1 where n is an l bit prime. The signature component r is generated by converting the x coordinate of the public key kP, where P is the seed point on the curve, to an integer mod n, i.e. r=x_(kp) mod n. The components=k⁻¹(H(m)+dr) mod n and the signature on the message m is (r,s).

[0013] It will be apparent in ElGamal signature schemes such as the DSA and ECDSA, that if an ephemeral key k and the associated message m and signature (r,s) is obtained it may be used to yield the long term private key d and thereafter each of the ephemeral keys k can be obtained. Neither the DSA nor the ECDSA inherently disclose any information about the public key k. They both require the selection of k to be performed by a random number generator and it will therefore have a uniform distribution throughout the defined interval. However the implementation of the DSA may be done in such a way as to inadvertently introduce a bias in to the selection of k. This small bias may be exploited to extract a value of the private key d and thereafter render the security of the system vulnerable. One such implementation is the DSS mandated by the National Institute of Standards and Technology (NIST) FIPS 186-2 Standard. The DSS stipulates the manner in which an integer is to be selected for use as a private key. A seed value, SV, is generated from a random number generator which is then hashed by a SHA−1 hash function to yield a bit string of predetermined length, typically 160 bits. The bit string represents an integer between 0 and 2¹⁶⁰−1. However this integer could be greater than the prime q and so the DSS requires the reduction of the integer mod q, i.e. k=SHA−1(seed) mod q.

[0014] Accordingly the algorithm for selecting k may be expressed as

[0015] if SHA−1(seed)≧q then k←SHA−1(seed)−q else k←SHA−11 (seed).

[0016] With this algorithm it is to be expected that more values will lie in the first interval than the second and therefore there is a potential bias in the selection of k.

[0017] Recent work by Daniel Bleichenbacher suggests that the modular reduction to obtain k introduces sufficient bias in to the selection of k that an examination of 2²² signatures could yield the private key d in 2⁶⁴ steps using 2⁴⁰ memory units. This suggests that there is a need for the careful selection of the ephemeral key k.

SUMMARY OF THE INVENTION

[0018] It is therefore an object of the present invention to obviate or mitigate the above disadvantages in the Generation of a private key.

[0019] In general terms the present invention provides a key generation technique in which any bias is eliminated during the selection of the key.

BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Embodiments of the invention will now be described by way of example only with reference to the accompanying drawings in which:

[0021]FIG. 1 is a schematic representation of a data communication system;

[0022]FIG. 2 is a flow chart showing a first embodiment of key generation;

[0023]FIG. 3 is a flow chart showing a second embodiment;

[0024]FIG. 4 is a flow chart showing a third embodiment;

[0025]FIG. 5 is a flow chart showing a fourth embodiment;

[0026]FIG. 6 is a flow chart showing a fifth embodiment; and

[0027]FIG. 7 is a flow chart showing a sixth embodiment.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0028] Referring, therefore to FIG. 1, a data communication system 10 includes a pair of correspondents 12, 14 connected by a communication link 16. The link 16may be a dedicated link, a multipurpose link such as a telephone connection or a wireless link depending on the particular applications. Similarly, the correspondents 12, 14 may be computer terminals, point-of-sale devices, automated teller machines, constrained devices such as PDA's, cellphones, pagers or any other device enabled For communication over a link 16.

[0029] Each of the correspondents 12, 14 includes a secure cryptographic function 20 including a secure memory 22, an arithmetic processor 24 for performing finite field operations, a random number Generator 26 and a cryptographic hash function 28 for performing a secure cryptographic hash such as SHA−1. The output of the function 28 will be a bit string of predetermined length, typically 160 bits although other lengths such as 256, 384 or 513 are being used more frequently. It will be appreciated that each of these functions is controlled by a processor executing instructions to provide functionality and inter-operability as is well known in the art.

[0030] The secure memory 22 includes a register 30 for storing a long-term private key, d, and a register 32 for storing an ephemeral private key k. The contents of the registers 30, 32 may be retrieved for use by the processor 24 for performing signatures, key exchange and key transport functions in accordance with the particular protocols to be executed under control of the processor.

[0031] The long term private key, d, is generated and embedded at the time of manufacture or initialization of the cryptographic function and has a corresponding long-term public key α^(d). The long-term public key α^(d) is stored in the memory 22 and is generally made available to other correspondents of the system 10.

[0032] The ephemeral key, k, is generated at each signature or other cryptographic exchange by one of the routines disclosed below with reference to FIGS. 2 to 9. Once the key, k, and corresponding public key α^(k) is generated, it is stored in the register 32 for use in the cryptographic protocol, such as the DSA or ECDSA described above.

[0033] Referring, therefore, to FIG. 2, a first method of generating a key, k, originates by obtaining a seed value (SV) from the random number generator 26. For the purposes of an example, it will be assumed that the cryptographic function is performed over a group of order q, where q is a prime represented as a bit string of predetermined length 1. By way of example only it will be assumed that the length l is 160 bits, although, of course, other orders of the field may be used.

[0034] To provide a value of k of the appropriate order, the hash function 28 has an l bit output, e.g. a 160 bit output. The bit string generated by the random number generator 26 is greater than l bits and is therefore hashed by the function 28 to produce an output H(seed) of l bits.

[0035] The resultant output H(seed) is tested against the value of q and a decision made based on the relative values. If H(seed)<q then it is accepted for use as k. If not. the value is rejected and the random number generator is conditioned to generate a new value which is again hashed by the function 28 and tested. This loop continues until a satisfactory value is obtained.

[0036] A further embodiment is shown in FIG. 3. In this embodiment, the output of the random number generator 26 is hashed by hash function 28 as before and tested against the value of q. If the H(seed) value is not accepted, the output of the random number generator 26 is incremented by a deterministic function and rehashed by function 28.

[0037] The resultant value H(seed) is again tested and the procedure repeated until a satisfactory value of k is obtained.

[0038] The output may be incremented by adding a particular value to the seed value at each iteration, or may be incremented by applying a non-linear deterministic function to the seed value. For example, the output may be incremented by applying the function ƒ(seed)=a.seed²+b mod 2 ¹⁶⁰, where a and b are integer constants.

[0039] A further embodiment is shown in FIG. 4 which has particular applicability to an elliptic curve cryptosystem. By way of example it will be assumed that a 163 bit string is required and that the output of the hash function 28 is 160 bits.

[0040] The random number generator 26 generates a seed value SV which is processed by the hash function 28 to obtain a first output H(seed).

[0041] The seed value SV is incremented by a selected function to provide a seed value SV+ which is further processed by the hash function 28 to provide a second output H(seed+).

[0042] The two outputs are then combined, typically by cocatenation, to produce a 320 bit string H(seed)//H(seed+). The excess bits, in this case 157 are rejected and the resultant value tested against the value of q. If the resultant value is less than q, it is accepted as the key k, if not the value is rejected.

[0043] Upon rejection, the random number generator may generate a new value as disclosed in FIG. 2 or may increment the seed value as disclosed in FIG. 3.

[0044] A further embodiment is shown in FIG. 5 which is similar to that of FIG. 4. In the embodiment of FIG. 5, the selection of the required l bit string is obtained by applying a l-bit wide masking window to the combined bit string.

[0045] This is tested against the value of q and if acceptable is used as the value of k. If it is not acceptable it is rejected and the l bit window incremented along the combined bit string to obtain anew value.

[0046] The values are tested and the window incremented until a satisfactory value is obtained.

[0047] A similar procedure may be used directly on an extended output of the hash function 28 as shown in FIG. 6 by applying a window to obtain the required I bit string. The bit string is tested against q and the window incremented until a satisfactory value of k is obtained.

[0048] As shown in FIG. 7, the value of k may be generated by utilizing a low Hamming weight integer obtained by combine the output of the random number generator 26 to facilitate computation of an intermediate public key α^(k). The integer is masked by combination with predetermined precomputed value k′ to obtain the requisite Hamming weight for security. Such a procedure is disclosed in copending Canadian application 2,217,925. This procedure is modified to generate the low Hamming weight integer k as a bit string greater than l, for example a 180 bit string The masking value k′ is distributed throughout the 180 bit string and the resultant value reduced mod q to obtain a 163 bit value k″. Note that the value α^(k″)can be efficiently computed by combining the precomputed value α^(′)with the efficiently computable value α^(k).

[0049] A similar technique may be used by relying on multiplicative masking. In this embodiment the value of k is combined with a value β where β=α^(u). The value of u is a secret value that is used to mask the low Hamming weight of k. Again, the values of u and the low Hamming weight number k can be chosen to have bit lengths greater than l, for example, bit lengths of 180. The resultant value is k″=u^(k) mod q. It will be appreciated that α^(k″) can be efficiently computed since β=α^(u) is precomputed, and since k has low Hamming weight.

[0050] Although the invention has been described with reference to certain specific embodiments, various modifications thereof will be apparent to those skilled in the art without departing from the spirit and scope of the invention as outlined in the claims appended hereto. 

The embodiment of the invention in which an exclusive property or privilege is claimed are defined as follows:
 1. A method of generating a key over a group of order q, said method including the steps of: generating a seed value from a random number generator; performing a hash function on said seed number to provide an output; determining whether said output is less than said prime number q; accepting said output for use as a key if the value thereof is less than said prime number q; and rejecting said output as a key if said value is not less than said order q.
 2. The method of claim 1 wherein another seed value is generated by said random number generator if said output is rejected.
 3. The method of claim 1 wherein the step of accepting said output as a key includes a further step of storing said key.
 4. The method of claim 1 wherein said key is used for generation of a public key.
 5. The method of claim 1 wherein said order q is prime number represented by a bit string of predetermined length
 1. 6. The method of claim 5 wherein said output from said hash function is a bit string of predetermined length
 1. 7. The method of claim 1 wherein if said output is rejected, said output is incremented by a deterministic function and a hash function is performed on said incremented output to produce a new output; a determination being made as to whether said new output is acceptable as a key.
 8. The method of claim 7, wherein said step of incrementing includes a further step of adding a particular value to said seed value.
 9. A method of generating a key over a group of order q, said method including the steps of: generating a seed value from a random number generator; performing a hash function on said seed number to provide a first output; incrementing said seed value by a predetermined function and performing said hash function on said incremented seed value to provide a second output; combining said first output and second output to produce a new output; determining whether said new output has a value less than said order q; accepting said new output as a key k if said new output has a value less than order q; and rejecting said new output as a key if said new output has a value less than order q
 10. The method of claim 9 wherein upon rejection of said new output a new seed value is generated by said random number generator.
 11. The method of claim 9 wherein upon rejection of said new output said seed value is incremented by a predetermined function and revised values for said first output and said second output are obtained.
 12. The method of claim 9 wherein a bit string greater than a predetermined length 1 is obtained and an 1 bit string selected therefrom for comparison with said order q.
 13. The method of claim 12 wherein upon rejection of said bit string of predetermined length 1, a further 1 bit string is selected.
 14. The method of claim 9 wherein said step of combining said first and second outputs includes a further step of rejecting excess bits such that said new output is a bit string of length
 1. 